Multifractal decomposition on certain random recursive sets 一類隨機遞歸集的重分形分解
The multifractal decomposition of a class of generalized multi - type random recursive sets on statistically self - similar measures 一類多型隨機遞歸集關于統計自相似測度的重分形分解
In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after a finite amount of time and correctly decides whether or not a given number belongs to the set.